A Non-dominated Sorting Bit Matrix Genetic Algorithm for P2P Relay Optimization
نویسندگان
چکیده
Cooperative caching and relaying content in ISPs can decrease the bandwidth costs and distribution time. The relay resources installed at ISP are limited and the upload rates of relay servers are various. After formulating the optimization problem, we design a Nondominated Sorting Bit matrix Genetic Algorithm (NSBGA) to solve it. Constraint-satisfied population is initialized according to resource ratio dynamically; improved alone point crossover and symmetric mutation is designed; population is non-dominated sorted. The experiments show that NSBGA is better than NSGAII and it can support P2P relay optimization very well. The relations between performances and parameters as the numbers of ISPs, source channels and relay servers are analyzed. As a general optimization algorithm, NSBGA also can be used in other application fields.
منابع مشابه
Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملMulti-objective robust optimization model for social responsible closed-loop supply chain solved by non-dominated sorting genetic algorithm
In this study a supply chain network design model has been developed considering both forward and reverse flows through the supply chain. Total Cost, environmental factors such as CO2 emission, and social factors such as employment and fairness in providing job opportunities are considered in three separate objective functions. The model seeks to optimize the facility location proble...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کاملA method for identifying software components based on Non-dominated Sorting Genetic Algorithm
Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...
متن کاملA knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کامل